A multiperiod workforce scheduling and routing problem with dependent tasks
نویسندگان
چکیده
منابع مشابه
Computational Study for the Workforce Scheduling and Routing Problem
In this paper we present a computational study on 112 instances of the workforce scheduling and routing problem (WSRP). This problem has applications in many service provider industries where employees are required to visit customers to perform certain activities. Given their similarity, we adapt a mathematical programming model from the literature on vehicle routing problem with time windows (...
متن کاملA mathematical model for vehicle routing and scheduling problem with cross-docking by considering risk
Today, many companies after achieving improvements in manufacturing operations are focused on the improvement of distribution systems and have long been a strong tendency to optimize the distribution network in order to reduce logistics costs that the debate has become challenging. Improve the flow of materials, an activity considered essential to increase customer satisfaction. In this study, ...
متن کاملMixed Integer Programming with Decomposition to Solve a Workforce Scheduling and Routing Problem
We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that are distributed across different geographical locations. This problem arises from a number of home care planning scenarios in the UK, faced by our industrial partner. We present a mixed integer programm...
متن کاملA Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints
We present a greedy heuristic (GHI) designed to tackle five time-dependent activities constraints (synchronisation, overlap, minimum difference, maximum difference and minimum-maximum difference) on workforce scheduling and routing problems. These types of constraints are important because they allow the modelling of situations in which activities relate to each other time-wise, e.g. synchronis...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2020
ISSN: 0305-0548
DOI: 10.1016/j.cor.2020.104930